Spherical Layout Implementation using Centroidal Voronoi Tessellations

نویسندگان

  • Martin Larrea
  • Dana K. Urribarri
  • Sergio Martig
  • Silvia Mabel Castro
چکیده

The 3D tree visualization faces multiple challenges: the election of an appropriate layout, the use of the interactions that make the data exploration easier and a metaphor that helps in the process of information understanding. A good combination of these elements will result in a visualization that effectively conveys the key features of a complex structure or system to a wide range of users and permits the analytical reasoning process. In previous works we presented the Spherical Layout, a technique for 3D tree visualization that provides an excellent base to achieve those key features. The layout was implemented using the TriSphere algorithm, a method that discretized the spheres's surfaces with triangles to achieve a uniform distribution of the nodes. The goal of this work was centered in a new algorithm for the implementation of the Spherical layout; we called it the Weighted Spherical Centroidal Voronoi Tessellations (WSCVT). In this paper we present a detailed description of this new implementation and a comparison with the TriSphere algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations

A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations constructed by individual processors. The algorithm is then modified, by the addition of stereographic projections, to handle the parallel construct...

متن کامل

Approximations of a Ginzburg-Landau model for superconducting hollow spheres based on spherical centroidal Voronoi tessellations

In this paper the numerical approximations of the GinzburgLandau model for a superconducting hollow spheres are constructed using a gauge invariant discretization on spherical centroidal Voronoi tessellations. A reduced model equation is used on the surface of the sphere which is valid in the thin spherical shell limit. We present the numerical algorithms and their theoretical convergence as we...

متن کامل

Gyrolayout: A Hyperbolic Level-of-Detail Tree Layout

Many large datasets can be represented as hierarchical structures, introducing not only the necessity of specialized tree visualization techniques, but also the requirements of handling large amounts of data and offering the user a useful insight into them. Many two-dimensional techniques have been developed, but 3-dimensional ones, together with navigational interactions, present a promising a...

متن کامل

Approximation of a Spherical Tessellation by the Laguerre Voronoi Diagram

This paper presents a method for approximating spherical tessellations, the edges of which are geodesic arcs, using spherical Laguerre Voronoi diagrams. The approximation method involves fitting the polyhedron corresponding to the spherical Laguerre Voronoi diagram to the observed tessellation using optimization techniques.

متن کامل

Numerical Studies of MacQueen’s k-Means Algorithm for Computing the Centroidal Voronoi Tessellations

We study a probabilistic algorithm for the computation of the centroidal Voronoi tessellation which is a Voronoi tessellation of a given set such that the associated generating points are centroids (centers of mass) of the corresponding Voronoi regions. We discuss various issues related to the implementation of the algorithm and provide numerical results. Some measures to improve the performanc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0912.3974  شماره 

صفحات  -

تاریخ انتشار 2009